Evolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm
نویسندگان
چکیده
In this paper, we propose a new multi-objective evolutionary algorithm (MOEA), which transforms a multi-objective optimization problem into a linear assignment problem using a set of weight vectors uniformly scattered. Our approach adopts uniform design to obtain the set of weights and Kuhn-Munkres’ (Hungarian) algorithm to solve the assignment problem. Differential evolution is used as our search engine, giving rise to the so-called Hungarian Differential Evolution algorithm (HDE). Our proposed approach is compared with respect to a MOEA based on decomposition (MOEA/D) and with respect to an indicatorbased MOEA (the S metric selection Evolutionary Multi-Objective Algorithm, SMS-EMOA) using several test problems (taken from the specialized literature) having from two to ten objective functions. Our preliminary experimental results indicate that our proposed HDE outperforms MOEA/D and is competitive with respect to SMS-EMOA, but at a significantly lower computational cost.
منابع مشابه
Multi-objective optimization design of plate-fin heat sinks using an Evolutionary Algorithm Based On Decomposition
This article has no abstract.
متن کاملKarush-Kuhn-Tucker Optimality Based Local Search for Enhanced Convergence of Evolutionary Multi-Criterion Optimization Methods
Recent studies have used Karush-Kuhn-Tucker (KKT) optimality conditions to develop a KKT ProximityMeasure (KKTPM) for terminating amulti-objective optimization simulation run based on theoretical convergence of solutions. In addition to determining a suitable termination condition and due to their ability to provide a single measure for convergence to Pareto-optimal solutions, the developed KKT...
متن کاملKuhn-Munkres Parallel Genetic Algorithm for the Set Cover Problem and Its Application to Large-Scale Wireless Sensor Networks
متن کامل
OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS
Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...
متن کاملA Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کامل